Point Counting in Families of Hyperelliptic Curves
نویسنده
چکیده
Let EΓ be a family of hyperelliptic curves defined by Y 2 = Q(X,Γ), where Q is defined over a small finite field of odd characteristic. Then with γ in an extension degree n field over this small field, we present a deterministic algorithm for computing the zeta function of the curve Eγ by using Dwork deformation in rigid cohomology. The complexity of the algorithm is O(n) and it needs O(n) bits of memory. A slight adaptation requires only O(n) space, but costs time Õ(n). An implementation of this last result turns out to be quite efficient for n big enough. AMS (MOS) Subject Classification Codes: 11G20, 11Y99, 12H25, 14F30, 14G50, 14Q05.
منابع مشابه
Computing zeta functions in families of Ca,b curves using deformation
We apply deformation theory to compute zeta functions in a family of Ca,b curves over a finite field of small characteristic. The method combines Denef and Vercauteren’s extension of Kedlaya’s algorithm to Ca,b curves with Hubrechts’ recent work on point counting on hyperelliptic curves using deformation. As a result, it is now possible to generate Ca,b curves suitable for use in cryptography i...
متن کاملComputing Zeta Functions in Families of Ca, b
We apply deformation theory to compute zeta functions in a family of Ca,b curves over a finite field of small characteristic. The method combines Denef and Vercauteren’s extension of Kedlaya’s algorithm to Ca,b curves with Hubrechts’ recent work on point counting on hyperelliptic curves using deformation. As a result, it is now possible to generate Ca,b curves suitable for use in cryptography i...
متن کاملPoint Counting in Families of Hyperelliptic Curves in Characteristic 2
Let ĒΓ be a family of hyperelliptic curves over F cl 2 with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm for computing the zeta function of Ēγ̄, with γ̄ in a degree n extension field of F, which has as time complexity Õ(n3) bit operations and memory requirements O(n2) bits. With a slightly different algorithm we can get time O(n2.667) and me...
متن کاملPoint Counting on Genus 3 Non Hyperelliptic Curves
We propose an algorithm to compute the Frobenius polynomial of an ordinary non hyperelliptic curve of genus 3 over F2N . The method is a generalization of Mestre’s AGM-algorithm for hyperelliptic curves and leads to a quasi quadratic time algorithm for point counting. The current methods for point counting on curves over finite fields of small characteristic rely essentially on a p-adic approac...
متن کاملar X iv : m at h / 06 07 34 6 v 1 [ m at h . N T ] 1 4 Ju l 2 00 6 Point counting in families of hyperelliptic curves in characteristic 2
Let ĒΓ be a family of hyperelliptic curves over F alg cl 2 with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm to compute the zeta function of Ēγ̄ for γ̄ in a degree n extension field of F, which has as time complexity Õ(n) and memory requirements O(n). With a slightly different algorithm we can get time O(n) and memory O(n), and the computati...
متن کاملFields of definition of torsion points on the Jacobians of genus 2 hyperelliptic curves over finite fields
This paper deals with fields of definition of the l-torsion points on the Jacobians of genus 2 hyperelliptic curves over finite fields in order to speed Gaudry and Schost’s point counting algorithm for genus 2 hyperelliptic curves up. A result in this paper shows that the extension degrees of the fields of difinition of the l-torsion points can be in O(l) instead of O(l). The effects of the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Foundations of Computational Mathematics
دوره 8 شماره
صفحات -
تاریخ انتشار 2008